Stressed, but connected

The processing of stressed syllables in connected speech

Spaces That Are Connected but Not Path-connected

A topological space X is called connected if it’s impossible to write X as a union of two nonempty disjoint open subsets: if X = U ∪ V where U and V are open subsets of X and U ∩ V = ∅ then one of U or V is empty. Intuitively, this means X consists of one piece. A subset of a topological space is called connected if it is connected in the subspace topology. The most fundamental example of a con...

Connected but not path-connected subspaces of infinite graphs

Solving a problem of Diestel [8] we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and pathconnectedness do coincide for all but a few sets, which have a complicated structure.

Reconstruction of 8-connected but not 4-connected hv-convex discrete sets

The reconstruction of 8-connected but not 4-connectedhv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity ...

A Fast Algorithm for Reconstructing hv-Convex 8-Connected but Not 4-Connected Discrete Sets

One important class of discrete sets where the reconstruction from two given projections can be solved in polynomial time is the class of hv-convex 8-connected sets. The worst case complexity of the fastest algorithm known so far for solving the problem is of O(mn · min{m2, n2}) [2]. However, as it is shown, in the case of 8-connected but not 4-connected sets we can give an algorithm with worst...